4 research outputs found
On coalgebras with internal moves
In the first part of the paper we recall the coalgebraic approach to handling
the so-called invisible transitions that appear in different state-based
systems semantics. We claim that these transitions are always part of the unit
of a certain monad. Hence, coalgebras with internal moves are exactly
coalgebras over a monadic type. The rest of the paper is devoted to supporting
our claim by studying two important behavioural equivalences for state-based
systems with internal moves, namely: weak bisimulation and trace semantics.
We continue our research on weak bisimulations for coalgebras over order
enriched monads. The key notions used in this paper and proposed by us in our
previous work are the notions of an order saturation monad and a saturator. A
saturator operator can be intuitively understood as a reflexive, transitive
closure operator. There are two approaches towards defining saturators for
coalgebras with internal moves. Here, we give necessary conditions for them to
yield the same notion of weak bisimulation.
Finally, we propose a definition of trace semantics for coalgebras with
silent moves via a uniform fixed point operator. We compare strong and weak
bisimilation together with trace semantics for coalgebras with internal steps.Comment: Article: 23 pages, Appendix: 3 page
No more, no less - A formal model for serverless computing
Serverless computing, also known as Functions-as-a-Service, is a recent
paradigm aimed at simplifying the programming of cloud applications. The idea
is that developers design applications in terms of functions, which are then
deployed on a cloud infrastructure. The infrastructure takes care of executing
the functions whenever requested by remote clients, dealing automatically with
distribution and scaling with respect to inbound traffic.
While vendors already support a variety of programming languages for
serverless computing (e.g. Go, Java, Javascript, Python), as far as we know
there is no reference model yet to formally reason on this paradigm. In this
paper, we propose the first formal programming model for serverless computing,
which combines ideas from both the -calculus (for functions) and the
-calculus (for communication). To illustrate our proposal, we model a
real-world serverless system. Thanks to our model, we are also able to capture
and pinpoint the limitations of current vendor technologies, proposing possible
amendments
No More, No Less - A Formal Model for Serverless Computing
Part 3: Exploring New FrontiersInternational audienceServerless computing, also known as Functions-as-a-Service, is a recent paradigm aimed at simplifying the programming of cloud applications. The idea is that developers design applications in terms of functions, which are then deployed on a cloud infrastructure. The infrastructure takes care of executing the functions whenever requested by remote clients, dealing automatically with distribution and scaling with respect to inbound traffic.While vendors already support a variety of programming languages for serverless computing (e.g. Go, Java, Javascript, Python), as far as we know there is no reference model yet to formally reason on this paradigm. In this paper, we propose the first core formal programming model for serverless computing, which combines ideas from both the lambda-calculus (for functions) and the pi-calculus (for communication). To illustrate our proposal, we model a real-world serverless system. Thanks to our model, we capture limitations of current vendors and formalise possible amendments
A coalgebraic view of ε-transitions
Item does not contain fulltex